Patch Based Multiple Instance Learning Algorithm for Object Tracking
نویسندگان
چکیده
منابع مشابه
Patch Based Multiple Instance Learning Algorithm for Object Tracking
To deal with the problems of illumination changes or pose variations and serious partial occlusion, patch based multiple instance learning (P-MIL) algorithm is proposed. The algorithm divides an object into many blocks. Then, the online MIL algorithm is applied on each block for obtaining strong classifier. The algorithm takes account of both the average classification score and classification ...
متن کاملCAMSHIFT-based Algorithm for Multiple Object Tracking
This paper presents a technique for object tracking by using CAMSHIFT algorithm that tracks an object based on color. We aim to improve the CAMSHIFT algorithm by adding a multiple targets tracking function [1].When one object is selected as a template, it will search objects that have the same hue value and shape by shape recognition. Hence, the inputs of the algorithm are hue values and shape ...
متن کاملVisual Tracking Based on an Improved Online Multiple Instance Learning Algorithm
An improved online multiple instance learning (IMIL) for a visual tracking algorithm is proposed. In the IMIL algorithm, the importance of each instance contributing to a bag probability is with respect to their probabilities. A selection strategy based on an inner product is presented to choose weak classifier from a classifier pool, which avoids computing instance probabilities and bag probab...
متن کاملA VSS Algorithm Based on Multiple Features for Object Tracking
A variable search space (VSS) approach according to the color feature combined with point feature for object tracking is presented. Mean shift is a wellestablished and fundamental algorithm that works on the basis of color probability distributions, and is robust to given color targets. As it solely depends upon back projected probabilities, it may miss the targets because of illumination and n...
متن کاملDissimilarity-Based Multiple Instance Learning
In this paper, we propose to solve multiple instance learning problems using a dissimilarity representation of the objects. Once the dissimilarity space has been constructed, the problem is turned into a standard supervised learning problem that can be solved with a general purpose supervised classifier. This approach is less restrictive than kernelbased approaches and therefore allows for the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Intelligence and Neuroscience
سال: 2017
ISSN: 1687-5265,1687-5273
DOI: 10.1155/2017/2426475